Quantum circuits and Spin(3n) groups
نویسندگان
چکیده
منابع مشابه
Quantum circuits and Spin(3n) groups
All quantum gates with one and two qubits may be described by elements of Spin groups due to isomorphisms Spin(3) ≃ SU (2) and Spin(6) ≃ SU (4). However, the group of n-qubit gates SU (2 n) for n > 2 has bigger dimension than Spin(3n). A quantum circuit with one-and two-qubit gates may be used for construction of arbitrary unitary transformation SU (2 n). Analogously, the 'Spin(3n) circuits' ar...
متن کاملGeneralized clifford groups and simulation of associated quantum circuits
Quantum computations that involve only Clifford operations are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the theorem and provide generalisations of some of them with the aim of identifying new classes of simulable quantum computations. In the usual construction, Cliffo...
متن کاملOptimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits
There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2015
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic15.3-4-3